A note on minimum-dummy-activities PERT networks

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A special Class of Stochastic PERT Networks

Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure.&#10In series-parallel SPN, the completion time distribution...

متن کامل

A special Class of Stochastic PERT Networks

Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure. In series-parallel SPN, the completion time distribution f...

متن کامل

On the Minimum Dummy - Arc Problem

A precedence relation can be represented non-uniquely by an activity on arc (AoA) directed acyclic graph (dag). This paper deals with the NP-hard problem of constructing an AoA dag having the minimum number o f arcs among those that have the minimum number of nodes. We show how this problem can be reduced in polynomial time to the set-cover problem so that the known methods of solving the set-c...

متن کامل

A note on the reasonableness of PERT hypotheses

In this paper the expression for the mean in the PERT method is considered. This mean involves a parameter k, that sometimes has been set to 4. Insisting on the similarity between the beta and the normal distributions, certain hypotheses are proposed that lead to k necessarily being exactly 4. More speci6cally, by using the moments of the second and fourth orders, it is shown that the usual bet...

متن کامل

Interdiction Games on Markovian PERT Networks

In a stochastic interdiction game a proliferator aims to minimize the expected duration of a nuclear weapons development project, while an interdictor endeavors to maximize the project duration by delaying some of the project tasks. We formulate static and dynamic versions of the interdictor’s decision problem where the interdiction plan is either pre-committed or adapts to new information reve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: RAIRO - Operations Research

سال: 1984

ISSN: 0399-0559,1290-3868

DOI: 10.1051/ro/1984180404151